A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications

نویسندگان

  • Bernard Chazelle
  • Herbert Edelsbrunner
  • Leonidas J. Guibas
  • Micha Sharir
چکیده

Chazelle, B., H. Edelsbrunner, L.J. Guibas and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Theoretical Computer Science 84 (1991) 77-105. This paper describes an effective procedure for stratifying a real semi-algebraic set into cells of constant description size. The attractive feature of our method is that the number of cells produced is singly exponential in the number of input variables. This compares favorably with the doubly exponential size of Collins’ decomposition. Unlike Collins’ construction, however, our scheme does not produce a cell complex but only a smooth stratification. Nevertheless, we are able to apply our results in interesting ways to problems of point location and geometric optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding the equivariant Betti numbers of symmetric semi-algebraic sets

Let R be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of R in terms of the number and degrees of the defining polynomials has been an important problem in real algebraic geometry with the first results due to Olĕınik and Petrovskĭı, Thom and Milnor. These bounds are all exponential in the number of variables k. Motivated by several ap...

متن کامل

Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets

In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincaré characteristic, were known before. No singly exponential algorithm was known for computing any of the individual Betti numbers other than the zero-th one. We also give algorithms ...

متن کامل

Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time

For every fixed l > 0, we describe a singly exponential algorithm for computing the first l Betti number of a given semi-algebraic set. More precisely, we describe an algorithm that given a semi-algebraic set S ⊂ Rk a semi-algebraic set defined by a Boolean formula with atoms of the form P > 0, P < 0, P = 0 for P ∈ P ⊂ R[X1, . . . ,Xk], computes b0(S), . . . , bl(S). The complexity of the algor...

متن کامل

5 Conclusions and Open Problems 4.4 an Algorithm with Subquadratic Overhead

A singly-exponential stratiication scheme for real semi-algebraic varieties and its applications. 28 If we stop because of (i), this means that throughout the way z + (y) and z ? (y) are visible to one another, and therefore the face is y-monotone. If we stop because z + (y) and z ? (y) stop seeing one another, then it must be the case that the intrusion is due to the left endpoint of a curve o...

متن کامل

Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets

We give algorithms with polynomially bounded complexities (for fixed degrees) for computing the generalized Euler-Poincaré characteristic of semi-algebraic sets defined by symmetric polynomials. This is in contrast to the best complexity of the known algorithms for the same problem in the non-symmetric situation, which is singly exponential. This singly exponential complexity for the latter pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 84  شماره 

صفحات  -

تاریخ انتشار 1991